Concept Model Semantics for DL Preferential Reasoning
نویسندگان
چکیده
The preferential and rational consequence relations first studied by Lehmann and colleagues play a central role in non-monotonic reasoning, not least because they provide the foundation for the determination of the important notion of rational closure. Although they can be applied directly to a large variety of logics, these constructions suffer from the limitation that they are largely propositional in nature. One of the main obstacles in moving beyond the propositional case has been the lack of a formal semantics which appropriately generalizes the preferential and ranked models of Lehmann et al. In this paper we propose a semantics to fill that gap for description logics, an important class of decidable fragments of first-order logic. Our semantics replaces the propositional valuations used in the models of Lehmann et al. with structures we refer to as concept models. We prove representation results for the description logic ALC for both preferential and rational consequence relations. We argue that our semantics paves the way for extending preferential and rational consequence, and therefore also rational closure, to a whole class of logics that have a semantics defined in terms of first-order relational structures.
منابع مشابه
Towards Defeasible SROIQ
We present a decidable extension of the Description Logic SROIQ that supports defeasible reasoning in the KLM tradition, and extends it through the introduction of defeasible roles. The semantics of the resulting DL dSROIQ extends the classical semantics with a parameterised preference order on binary relations in a domain of interpretation. This allows for the use of defeasible roles in comple...
متن کاملSemantic Foundation for Preferential Description Logics
Description logics are a well-established family of knowledge representation formalisms in Artificial Intelligence. Enriching description logics with non-monotonic reasoning capabilities, especially preferential reasoning as developed by Lehmann and colleagues in the 90’s, would therefore constitute a natural extension of such KR formalisms. Nevertheless, there is at present no generally accept...
متن کاملPreferential model and argumentation semantics
Although the preferential model semantics is the standard semantics for non-monotonic reasoning systems, it is not used for argumentation frameworks. For argumentation frameworks, instead, argumentation semantics are used. This paper studies the relation between the two types of semantics. Several argumentation semantics are related to additional constraints on the preference relation over stat...
متن کاملA Logical Semantics for Description Logic Programs
We present a new semantics for Description Logic programs [1] (dlprograms) that combine reasoning about ontologies in description logics with non-monotonic rules interpreted under answer set semantics. Our semantics is equivalent to that of [1], but is more logical in style, being based on the logic QHT of quantified here-and-there that provides a foundation for ordinary logic programs under an...
متن کاملFinite Model Reasoning in DL-Lite
The semantics of OWL-DL and its subclasses are based on the classical semantics of first-order logic, in which the interpretation domain may be an infinite set. This constitutes a serious expressive limitation for such ontology languages, since, in many real application scenarios for the Semantic Web, the domain of interest is actually finite, although the exact cardinality of the domain is unk...
متن کامل